2 the Simplex Method
نویسندگان
چکیده
Linear programming has many important practical applications, and has also given rise to a wide body of theory. See Section 50.9 for recommended sources. Here we consider the linear programming problem in the form of maximizing a linear function of d variables subject to n linear inequalities. We focus on the relationship of the problem to computational geometry, i.e., we consider the problem in small dimension. More precisely, we concentrate on the case where d ≪ n, i.e., d = d(n) is a function that grows very slowly with n. By linear programming duality, this also includes the case n ≪ d. This has been called fixed-dimensional linear programming, though our viewpoint here will not treat d as constant. In this case there are strongly polynomial algorithms, provided the rate of growth of d with n is small enough. The plan of the chapter is as follows. In Section 50.2 we consider the simplex method, in Section 50.3 we review deterministic linear time algorithms, in Section 50.4 randomized algorithms, and in Section 50.5 we consider the derandomization of the latter. Section 50.6 discusses the combinatorial framework of LP-type problems, which underlie most current combinatorial algorithms and allows their application to a host of optimization problems. We briefly describe the more recent combinatorial framework of unique sink orientations, in the context of striving for algorithms with a milder dependence on d. In Section 50.7 we examine parallel algorithms for this problem, and finally in Section 50.8 we briefly discuss related issues. The emphasis throughout is on complexity-theoretic bounds for the linear programming problem in the form (50.1.1).
منابع مشابه
Augmented Downhill Simplex a Modified Heuristic Optimization Method
Augmented Downhill Simplex Method (ADSM) is introduced here, that is a heuristic combination of Downhill Simplex Method (DSM) with Random Search algorithm. In fact, DSM is an interpretable nonlinear local optimization method. However, it is a local exploitation algorithm; so, it can be trapped in a local minimum. In contrast, random search is a global exploration, but less efficient. Here, rand...
متن کاملTzanck smears in herpes simplex virus infections
Background: The diagnosis of herpes simplex virus may requirevirological confirmation. Tzanck smear is an old, rapid, costeffective but nonspecific method that has been recently re-evaluatedas a method for the diagnosis of herpes virus infection. This studywas conducted to compare Tzanck smear and viral culture in thediagnosis of herpes simplex virus infection in patients clinicallysuspected to...
متن کاملSome new results on semi fully fuzzy linear programming problems
There are two interesting methods, in the literature, for solving fuzzy linear programming problems in which the elements of coefficient matrix of the constraints are represented by real numbers and rest of the parameters are represented by symmetric trapezoidal fuzzy numbers. The first method, named as fuzzy primal simplex method, assumes an initial primal basic feasible solution is at hand. T...
متن کاملOptimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کاملSimplex design method in simultaneous spectrophotometric determination of silicate and phosphate in boiler water of power plant and sewage sample by partial least squares
Partial least squares modeling as a powerful multivariate statistical tool was applied tothe simultaneous spectrophotometric determination of silicate and phosphate in aqueoussolutions. The concentration range for silicate and phosphate were 0.02-0.6 and 0.4-3 μg ml-1,respectively. The experimental calibration set was composed with 30 sample solutions using amixture design for two component mix...
متن کاملChained Vector Simplex
An algorithm for solving linear programming problems whose matrix of coefficients contains a large number of "zero" entries is studied. This algorithm is more useful when it is generated as a sub-program in a real-time program. The singly linked lists for storing only the non-zero entries of the coefficients matrix is used. The modified Revised Simplex Method is also used for solving such probl...
متن کامل